Anytime Control Algorithm: Model Reduction Approach
نویسندگان
چکیده
منابع مشابه
A Convex Feasibility Approach to Anytime Model Predictive Control
This paper proposes to decouple performance optimization and enforcement of asymptotic convergence in Model Predictive Control (MPC) so that convergence to a given terminal set is achieved independently of how much performance is optimized at each sampling step. By embedding an explicit decreasing condition in the MPC constraints and thanks to a novel and very easy-to-implement convex feasibili...
متن کاملAnytime Dynamic A*: An Anytime, Replanning Algorithm
We present a graph-based planning and replanning algorithm able to produce bounded suboptimal solutions in an anytime fashion. Our algorithm tunes the quality of its solution based on available search time, at every step reusing previous search efforts. When updated information regarding the underlying graph is received, the algorithm incrementally repairs its previous solution. The result is a...
متن کاملRobust Model Predictive Control with Anytime Estimation
With an increasing autonomy in modern control systems comes an increasing amount of sensor data to be processed, leading to overloaded computation and communication in the systems. For example, a vision-based robot controller processes large image data from cameras at high frequency to observe the robot’s state in the surrounding environment, which is used to compute control commands. In real-t...
متن کاملMonitoring and control of anytime algorithms: A dynamic programming approach
Anytime algorithms offer a tradeoff between solution quality and computation time that has proved useful in solving time-critical problems such as planning and scheduling, belief network evaluation, and information gathering. To exploit this tradeoff, a system must be able to decide when to stop deliberation and act on the currently available solution. This paper analyzes the characteristics of...
متن کاملAnytime Algorithm for Feature Selection
Feature selection is used to improve performance of learning algorithms by finding a minimal subset of relevant features. Since the process of feature selection is computationally intensive, a trade-off between the quality of the selected subset and the computation time is required. In this paper, we are presenting a novel, anytime algorithm for feature selection, which gradually improves the q...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Guidance, Control, and Dynamics
سال: 2004
ISSN: 0731-5090,1533-3884
DOI: 10.2514/1.9457